Mesh reconstruction by meshless denoising and parameterization

نویسندگان

  • Lei Zhang
  • Ligang Liu
  • Craig Gotsman
  • Hua Huang
چکیده

We present a new approach to simultaneously denoise and parameterize unorganized point cloud data. This is achieved by minimizing an appropriate energy function defined on the point cloud and its parameterization. An iterative algorithm to minimize the energy is described. The key ingredient of our approach is an “as-rigid-as-possible” meshless parameterization to map a point cloud with disk topology to the plane without building the connectivity of the point cloud. Then 2D triangulation method can be applied to the planar parameterization to provide triangle connectivity for the 2D points, which can be transferred back to the 3D point cloud to form a triangle mesh surface. We also show how to generalize the approach to meshes with closed topology of any genus. Experimental results have shown that our approach can effectively denoise the point cloud and our meshless parameterization can preserve local distances in the point cloud, resulting in a more regular 3D triangle mesh, compared to other methods. Keywords—point clouds; denoising; meshless parameterization; triangulation; surface reconstruction

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Approach to Detect Boundaries for Meshless Parameterization and Surface Reconstruction

In this paper we present a boundary detection algorithm for unorganized point sets and apply it for surface reconstruction using the meshless parameterization method from M. S. Floater and M. Reimers, Meshless parameterization and surface reconstruction, Comp. Aided Geom. Design, 18:77-92, 2001. The algorithm consists of two steps. Under mild assumptions, we can prove that the first step of our...

متن کامل

Meshless parameterization and surface reconstruction

This paper proposes a method called meshless parameterization for param eterizing and triangulating single patch unorganized point sets The points are mapped into a planar parameter domain by solving a sparse linear system By making a stan dard triangulation of the parameter points we obtain a corresponding triangulation of the original data set

متن کامل

Learning quadrangulated patches for 3D shape parameterization and completion

We propose a novel 3D shape parameterization by surface patches, that are oriented by 3D mesh quadrangulation of the shape. By encoding 3D surface detail on local patches, we learn a patch dictionary that identifies principal surface features of the shape. Unlike previous methods, we are able to encode surface patches of variable size as determined by the user. We propose novel methods for dict...

متن کامل

Meshless geometric subdivision

Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with point cloud data directly, any processing is based on the given raw data and its underlying geometry rather than any arbitrary intermediate representations and generally artificial connectivity relations. In this paper, ...

متن کامل

Multi-View Stereo on Consistent Face Topology

We present a multi-view stereo reconstruction technique that directly produces a complete high-fidelity head model with consistent facial mesh topology. While existing techniques decouple shape estimation and facial tracking, our framework jointly optimizes for stereo constraints and consistent mesh parameterization. Our method is therefore free from drift and fully parallelizable for dynamic f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2010